Search

The energy problem in green manufacturing has attracted enormous attention from researchers and practitioners in the manufacturing domain with the global energy crisis and the aggravation of environmental pollution. The distributed blocking flow shop scheduling problem (DBFSP) has considerable application scenarios in connection with its widespread application in the industry under the background of intelligent manufacturing. A multi-objective discrete differential evolution (MODE) algorithm is proposed to solve the energy-efficient distributed blocking flow shop scheduling problem (EEDBFSP) with the objectives of the makespan and total energy consumption (TEC) in this paper. The cooperative initialisation strategy is proposed to generate the initial population of the EEDBFSP. The mutation, crossover, and selection operators are redesigned to enable the MODE algorithm as applied to discrete space. A local search strategy based on the knowledge of five operators is introduced to enhance the exploitation capability of the MODE algorithm in the EEDBFSP. The non-critical path energy-efficient strategy is proposed to reduce energy consumption according to the specific constraints in the EEDBFSP. The effectiveness of each strategy in the MODE algorithm is verified and compared with the state-of-the-art algorithms. The numerical results demonstrate that the MODE algorithm is the efficient optimiser for solving the EEDBFSP. [ABSTRACT FROM AUTHOR]

In this paper we present the Markovian Multiagent Monte-Carlo Second Order Self-Consistent Field Algorithm (M3-SOSCF). This algorithm provides a highly reliable methodology for converging SCF calculations in single-reference methods using a modified differential evolution approach. Additionally, M3 is embarrassingly parallel and modular in regards to Newton–Raphson subroutines. We show that M3 is able to surpass contemporary SOSCFs in reliability, which is illustrated by a benchmark employing poor initial guesses and a second benchmark with SCF calculations which face difficulties using standard SCF algorithms. Furthermore, we analyse inherent properties of M3 and show that in addition to its robustness and efficiency, it is more user-friendly than current SOSCFs. [ABSTRACT FROM AUTHOR]

A differential evolution (DE) global optimization method for all-electron orbital-free density functional theory (OF-DFT) is presented. This optimization method does not need information about function derivatives to find extreme solutions. Results for a series of known orbital-free energy functionals are presented. Ground state energies of atoms (H to Ar) are obtained by direct minimization of the energy functional without using either Lagrange multipliers or damping procedures for reaching convergence. Our results are in agreement with previous OF-DFT calculations obtained using the standard Newton–Raphson and trust region methods. Being a zero-order method, the DE method can be applied to optimization problems dealing with non-differentiable functionals or functionals with non-closed forms. [ABSTRACT FROM AUTHOR]

Scheduling is an important decision-making problem in production planning and the resulting decisions have a direct impact on reducing waste, including energy and idle capacity. Batch scheduling problems occur in various industries from automotive to food and energy. This paper introduces the parallel p-batch scheduling problem with batch delivery, content-dependent loading/unloading times and energy-aware objective function. The problem has been motivated by a real system used for freezing products in a food processing company. A mixed-integer linear programming model (MILP) has been developed and explained through a numerical example. As it is not practical to solve large-size instances via a mathematical model, the discrete differential evolution algorithm has been improved (iDDE) and hybridised with the genetic algorithm (GA). A release-oriented vector generation procedure and a heuristic batch formation mechanism have been developed to efficiently solve the problem. The performance of the proposed approach (iDDEGA) has been compared with CPLEX, iDDE and GA through a comprehensive computational study. A case study was conducted based on real data collected from the freezing process of the company, which also verified the practical use and advantages of the proposed methodology. [ABSTRACT FROM AUTHOR]

Abstract The near-infinite compositional space of high-entropy-alloys (HEAs) is a huge resource-intensive task for developing exceptional materials. In the present study, an algorithmic framework has been developed to optimize the composition of an alloy with chosen set of elements, aiming to maximize the hardness of the former. The influence of phase on hardness prediction of HEAs was thoroughly examined. This study aims to establish generalized prediction models that aren’t confined by any specific set of elements. We trained the HEA identification model to classify HEAs from non-HEAs, the multi-labeled phase classification model to predict phases of HEAs also considering the processing route involved in the synthesis of the alloy, and the hardness prediction model for predicting hardness and optimizing the composition of the given alloy. The purposed algorithmic framework uses twenty-nine alloy descriptors to compute the composition that demonstrates maximum hardness for the given set of elements along with its phase(s) and a label stating whether it is classified as HEA or not.

Medical image segmentation is crucial in using digital images for disease diagnosis, particularly in post-processing tasks such as analysis and disease identification. Segmentation of magnetic resonance imaging (MRI) and computed tomography images pose distinctive challenges attributed to factors such as inadequate illumination during the image acquisition process. Multilevel thresholding is a widely adopted method for image segmentation due to its effectiveness and ease of implementation. However, the primary challenge lies in selecting the optimal set of thresholds to achieve accurate segmentation. While Otsu's between-class variance and Kapur's entropy assist in identifying optimal thresholds, their application to cases requiring more than two thresholds can be computationally intensive. Meta-heuristic algorithms are commonly employed in literature to calculate the threshold values; however, they have limitations such as a lack of precise convergence and a tendency to become stuck in local optimum solutions. In this paper, we introduce an improved chameleon swarm algorithm (ICSA) to address these limitations. ICSA is designed for image segmentation and global optimization tasks, aiming to improve the precision and efficiency of threshold selection in medical image segmentation. ICSA introduces the concept of the "best random mutation strategy" to enhance the search capabilities of the standard chameleon swarm algorithm (CSA). This strategy leverages three distribution functions—Levy, Gaussian, and Cauchy—for mutating search individuals. These diverse distributions contribute to improved solution quality and help prevent premature convergence. We conduct comprehensive experiments using the IEEE CEC'20 complex optimization benchmark test suite to evaluate ICSA's performance. Additionally, we employ ICSA in image segmentation, utilizing Otsu's approach and Kapur's entropy as fitness functions to determine optimal threshold values for a set of MRI images. Comparative analysis reveals that ICSA outperforms well-known metaheuristic algorithms when applied to the CEC'20 test suite and significantly improves image segmentation performance, proving its ability to avoid local optima and overcome the original algorithm's drawbacks. Medical image segmentation is essential for employing digital images for disease diagnosis, particularly for post-processing activities such as analysis and disease identification. Due to poor illumination and other acquisition-related difficulties, radiologists are especially concerned about the optimal segmentation of brain magnetic resonance imaging (MRI). Multilevel thresholding is the most widely used image segmentation method due to its efficacy and simplicity of implementation. The issue, however, is selecting the optimum set of criteria to effectively segment each image. Although methods like Otsu's between-class variance and Kapur's entropy help locate the optimal thresholds, using them for more than two thresholds requires a significant amount of processing resources. Meta-heuristic algorithms are commonly employed in literature to calculate the threshold values; however, they have limitations such as a lack of precise convergence and a tendency to become stuck in local optimum solutions. Due to the aforementioned, we present an improved chameleon swarm algorithm (ICSA) in this paper for image segmentation and global optimization tasks to be able to address these weaknesses. In the ICSA method, the best random mutation strategy has been introduced to improve the searchability of the standard CSA. The best random strategy utilizes three different types of distribution: Levy, Gaussian, and Cauchy to mutate the search individuals. These distributions have different functions, which help enhance the quality of the solutions and avoid premature convergence. Using the IEEE CEC'20 test suite as a recent complex optimization benchmark, a comprehensive set of experiments is carried out in order to evaluate the ICSA method and demonstrate the impact of combining the best random mutation strategy with the original CSA in improving both the performance of the solutions and the rate at which they converge. Furthermore, utilizing the Otsu approach and Kapur's entropy as a fitness function, ICSA is used as an image segmentation method to select the ideal threshold values for segmenting a set of MRI images. Within the experiments, the ICSA findings are compared with well-known metaheuristic algorithms. The comparative findings showed that ICSA performs better than other competitors in solving the CEC'20 test suite and has a significant performance boost in image segmentation. [ABSTRACT FROM AUTHOR]

Presently, several communities are employing renewable integrated combined heat-power (CHP) microgrids to optimally supply connected heat-power loads. Whilst microturbines are often employed in CHP microgrids, their operational flexibility as a CHP technology remains underexamined. The proposed work studies this perspective with acceptable penetrations of renewable energy sources (RES). Dynamic scheduling of combined heat-power islanded microgrid with RES and energy storage is presented for optimizing cost, emission, losses, and heat output considering RES and load uncertainties. RES uncertainties are modeled using Weibull distribution while load uncertainties are generated stochastically. To obtain the best solution for the contradictory multiple objectives and to reduce dependency on any specific tuning parameter, a fuzzy attainment module is integrated into the modified differential evolution algorithm with dynamic mutation rates. First, the operational flexibility of cogeneration units with RES and RES uncertainties is studied without storage. Secondly, with storage, and finally with storage under different load uncertainty scenarios. With both electrical and thermal storage, total operating costs are found to be reduced by 2.6%, emission by 1.2%, waste heat by 12.1%, and power losses by 25.4% per day. Random load scenarios in ± 25% uncertainty range were found to produce variations in cost in the range of − 2.49% to + 5.93% and emission from − 1.13 to 2.22% showing the capability of the proposed approach under practical conditions. This study demonstrates a cost-effective combined heat-power dispatch to do away with unwarranted auxiliary units with environmental, and climatic benefits. [ABSTRACT FROM AUTHOR]

This work presents a finite element framework for simulating the quasi-static response of dielectric elastomer-based minimum energy structure (DEMES). The DEMES is an actuator formed by combining an inextensible frame and pre-stretched dielectric membrane that exhibits the unique shape-morphing characteristics of the actuator. A continuum strain energy-based model is implemented to investigate the impact of the different geometrical parameters on the performance of the DEMES actuator. Finite element analyses are performed using user-defined element (UEL) in ABAQUS for determining the equilibrium shape of the actuators and further investigating their electromechanical response. Experiments are performed using the commercially available VHB-4910 acrylic tape and the PET frames. 3D-printed reinforcements are used to impart anisotropy in the specimen. The findings of the model solutions provide preliminary insights on the alteration of the initial and final configurations of the DEMES affected by different geometrical parameters. It is observed that the shape of the electrode (rectangular, circular and triangular), compliant frame (rectangular, circular and triangular) and implemented stiffeners appreciably alter the attained initial configuration, final configuration and actuation range of the DEMES actuator. In general, this investigation can find its potential use in designing the futuristic DEMES through topological optimization of the compliant electrode and frame geometry together with material anisotropy of the elastomer. [ABSTRACT FROM AUTHOR]

Abstract—In this work addresses the surge in greenhouse gas emissions and fuel costs resulting from heightened energy demand, especially in developing nations. To counter these challenges, the focus is on optimizing renewable energy sources, which, though advantageous, are weather-dependent and require intricate management. The study introduces the Enhanced Self-Adaptive Differential Evolution (SADE) algorithm, encompassing solar, battery, and thermal sources, to maximize profitability. Real-time (RT) load profiles are used for performance analysis, comparing the proposed algorithm with existing techniques like PSO, Differential Evolution (DE) algorithm, and SADE algorithm. Improved energy storage technologies complement the increased utilization of renewable energy, enabling electricity storage during off-peak hours and release during peak demand, providing promising solutions for the energy industry. [ABSTRACT FROM AUTHOR]

Differential Evolution (DE) is widely recognized as a highly effective evolutionary algorithm for global optimization. It has proven its efficacy in tackling diverse problems across various fields and real-world applications. DE boasts several advantages, such as ease of implementation, reliability, speed, and adaptability. However, DE does have certain limitations, such as suboptimal solution exploitation and challenging parameter tuning. To address these challenges, this research paper introduces a novel algorithm called Enhanced Binary JADE (EBJADE), which combines differential evolution with multi-population and elites regeneration. The primary innovation of this paper lies in the introduction of strategy with enhanced exploitation capabilities. This strategy is based on utilizing the sorting of three vectors from the current generation to perturb the target vector. By introducing directional differences, guiding the search towards improved solutions. Additionally, this study adopts a multi-population method with a rewarding subpopulation to dynamically adjust the allocation of two different mutation strategies. Finally, the paper incorporates the sampling concept of elite individuals from the Estimation of Distribution Algorithm (EDA) to regenerate new solutions through the selection process in DE. Experimental results, using the CEC2014 benchmark tests, demonstrate the strong competitiveness and superior performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive differential evolution algorithm with multi-strategy, namely ESADE is proposed to solve the premature convergence and high time complexity for complex optimization problem. In the ESADE, the population is divided into several sub-populations after the fitness value of each individual is sorted. Then different mutation strategies are proposed for different populations to balance the global exploration and local optimization. Next, a new self-adaptive strategy is designed adjust parameters to avoid falling into local optimum while the convergence accuracy has reached its maximum value. And a complex airport gate allocation multi-objective optimization model with the maximum flight allocation rate, the maximum near gate allocation rate, and the maximum passenger rate at near gate is constructed, which is divided into several single-objective optimization model. Finally, the ESADE is applied solve airport gate allocation optimization model. The experiment results show that the proposed ESADE algorithm can effectively solve the complex airport gate allocation problem and achieve ideal airport gate allocation results by comparing with the current common heuristic optimization algorithms. [ABSTRACT FROM AUTHOR]

Aiming to address the defects of the arithmetic optimization algorithm (AOA), such as easy fall into local optimums and slow convergence speed during the search process, an improved arithmetic optimization algorithm (IAOA) is proposed and applied to the study of distribution network reconfiguration. Firstly, a reconfiguration model is established to reduce network loss, and a cosine control factor is introduced to reconfigure the math optimization accelerated (MOA) function to coordinate the algorithm's global exploration and local exploitation capabilities. Subsequently, a reverse differential evolution strategy is introduced to improve the overall diversity of the population and Weibull mutation is performed on the better-adapted individuals generated in each iteration to ensure the quality of the optimal individuals generated in each iteration and strengthen the algorithm's ability to approach the optimal solution. The performance of the improved algorithm is also tested using eight basis functions. Finally, simulation analysis is carried out by taking the IEEE33 and IEEE69 node systems and a real power distribution system as examples; the results show that the proposed algorithm can help to reconfigure the system quickly, and the system node voltages and network losses were significantly improved after the reconfiguration. [ABSTRACT FROM AUTHOR]

Permanent Magnet-Assisted Synchronous Reluctance Machines (PMASynRM) provide a low-cost alternative to Surface PM Machines due to the use of relatively lower grades of rare-earth (RE) or RE-free magnets, as the performance degradation due to weaker magnets is compensated by the presence of reluctance torque. However, the weaker magnets suffer from a high risk of demagnetization, leading to unreliable motor operation. Using a blend of RE and RE-free magnets has the potential to overcome this issue. This paper proposes to blend different grades of various rare-earth (RE) and rare-earth-free (RE-free) magnets in six different combinations and utilizes them in two-layer and three-layer U-shaped PMASynRM topologies with both eight-pole and six-pole variations. The rotor of the various designs is then optimized using a differential evolution (DE) based optimization algorithm to obtain low-cost designs with reduced RE magnet volume and minimum demagnetization risk. The optimization of each design is also integrated with the evaluation of mechanical stresses in the rotor laminations so as to maintain the stresses below the material yield strength. Furthermore, the various performance metrics, such as toque–speed/power–speed characteristics, demagnetization, and efficiency maps, are evaluated for each of the optimized and mechanically feasible designs. A quantitative comparison of the various optimized designs is also obtained to highlight the various trade-offs. The results indicate the feasibility of meeting the baseline torque requirement across the entire speed range, even with a 100% reduction in RE magnet volume and less than 5% demagnetization risk, while achieving a cost reduction exceeding 50%. Moreover, the two-layer, eight-pole designs exhibit relatively higher performance, whereas the three-layer, eight-pole designs are found to be the most economical option. [ABSTRACT FROM AUTHOR]

To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function ( f 1 - f 13 ) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems. [ABSTRACT FROM AUTHOR]

This paper presents an optimization tool for jacket structures to support Offshore Wind Turbines (OWTs). The tool incorporates several combinations of optimization algorithms and constraint-handling techniques (CHTs): Genetic Algorithm; Differential Evolution (DE); Tournament Selection Method; Multiple Constraint Ranking (MCR); Adaptive Penalty Method, and Helper-and-Equivalent Optimization. The objective function regards the minimization of the jacket weight; the design variables are the diameter and thickness of the tubular members. The constraints are related to natural frequencies and Ultimate Limit State criteria. The candidate solutions are evaluated by full nonlinear time-domain Finite Element coupled analyses. To assess the optimization algorithms and CHTs, a case study is presented for the standardized OWT/jacket structure from the Offshore Code Comparison Collaboration Continuation project. First, a numerical model is built and validated, in terms of masses, natural frequencies, and vibration modes; then, this model is employed to run the optimization tool for all combinations of optimization algorithms and CHTs. The results indicate that, while all methods lead to feasible optimal solutions that comply with the constraints and present considerable weight reductions, the best performer is the combination of the DE algorithm with the MCR constraint-handling technique. [ABSTRACT FROM AUTHOR]

The Western Xihu Basin (WXB), part of the East China Sea Shelf Basin (ECSSB), demonstrates distinct structural differences between different sub-areas. Understanding the origin and mechanism of these differences is critical for unravelling the formation and evolution of the Western Xihu Basin and the ECSSB. Based on high-resolution 2D and 3D seismic data, we investigate the structural characteristics and evolution of the hinged margin and discuss the underlying formation mechanisms. The results suggest that, while controlled by NNE-, NE- and NW-striking major faults, there are distinct differences in the fault geometry, margin structure, fault displacement rate, and margin evolution in different basin areas. In contrast to the conventional division scheme which divides the WXB into three general sub-areas, our results suggest that the WXB should be divided into seven sub-areas with different tectonic structures and stress histories. The evolution of the WXB can be divided into three stages: (1) the synrift stage in the Palaeocene and early Eocene, when NNE-, NE- and NW-striking major faults were highly active and controlled the initial formation of the hinged margin structure; (2) late synrift stage in the late Eocene, when the faulting activity diminished, and the control of faults on the margin evolution decreased; (3) postrift stage from the Oligocene onwards, when active faulting ceased and sedimentation and differential basement subsidence became the main factors controlling basin evolution. The formation and reactivation of NW-striking faults under influence of the Izanagi-Pacific ridge subduction during the Mesozoic provided the basis for the differential evolution of the WXB in Cenozoic. [ABSTRACT FROM AUTHOR]

In response to the low efficiency and poor quality of current seed optimization algorithms for multi-threshold image segmentation, this paper proposes the utilization of the normal distribution in the cluster distribution mathematical model, the Levy flight mechanism, and the differential evolution algorithm to address the deficiencies of the seed optimization algorithm. The main innovation lies in applying the BBO algorithm to image multi threshold segmentation, providing a new perspective and method for image segmentation tasks. The second significant progress is the combination of Levy flight dynamics and differential evolution algorithm (DEA) to improve the BBO algorithm, thereby enhancing its performance and image segmentation quality. Therefore, a multi-threshold image segmentation model based on the optimized seed optimization algorithm is developed. The experimental results showed that on the function f1, the iteration of the improved seed optimization algorithm was 53, the Generational Distance value was 0.0020, the Inverted Generational Distance value was 0.098, and the Spacing value was 0.051. Compared with the other two algorithms, the improved seed optimization algorithm has better image segmentation performance and clearer image segmentation details. In summary, compared with existing multi-threshold image segmentation methods, the proposed multi-threshold image segmentation model based on the improved seed optimization algorithm has a better image segmentation effect and higher efficiency, can significantly improve the quality of image segmentation, has positive significance for the development of image processing technology, and also provides references for the improvement and application of optimization algorithms. [ABSTRACT FROM AUTHOR]

Quasi-Affine Transformation Evolutionary (QUATRE) algorithm is a kind of swarm-based collaborative optimization algorithm that solves the problem of a position deviation in a DE search by using the co-evolution matrix M instead of the cross-control parameter CR in the differential evolution algorithm (DE). However, QUATRE shares some of the same weaknesses as DE, such as premature convergence and search stagnation. Inspired by the artificial bee colony algorithm (ABC), we propose a new QUATRE algorithm to improve these problems that ranks all the individuals and evolves only the poorer half of the population. In an evolving population, individuals of different levels intersect with dimensions of different sizes to improve search efficiency and accuracy. In addition, we establish a better selection framework for the parent generation individuals and select more excellent parent individuals to complete the evolution for the individuals trapped in search stagnation. To verify the performance of the new QUATRE algorithm, we divide the comparison algorithm into three groups, including ABC variant group, DE variant group, and QUATRE variant group, and the CEC2014 test suite is used for the comparison. The experimental results show the new QUATRE algorithm performance is competitive. We also successfully apply the new QUATRE algorithm on the 3D path planning of UAV, and compared with the other famous algorithm performance it is still outstanding, which verifies the algorithm's practicability. [ABSTRACT FROM AUTHOR]

A method for in-situ stress measurement via fiber optics was proposed. The method utilizes the relationship between rock mass elastic parameters and in-situ stress. The approach offers the advantage of long-term stress measurements with high spatial resolution and frequency, significantly enhancing the ability to measure in-situ stress. The sensing casing, spirally wrapped with fiber optic, is cemented into the formation to establish a formation sensing nerve. Injecting fluid into the casing generates strain disturbance, establishing the relationship between rock mass properties and treatment pressure. Moreover, an optimization algorithm is established to invert the elastic parameters of formation via fiber optic strains. In the first part of this paper series, we established the theoretical basis for the inverse differential strain analysis method for in-situ stress measurement, which was subsequently verified using an analytical model. This paper is the fundamental basis for the inverse differential strain analysis method. [ABSTRACT FROM AUTHOR]

The energy conversion efficiency of wave energy device is one of the key problems in the large-scale utilization of wave energy. The study of the maximum output POWER of PTO (Power-Take-Off) system provides a theoretical reference for the efficient utilization of energy. In this paper, genetic algorithm and adaptive differential evolution algorithm based on neighborhood search are used to optimize the two-objective multi-order differential equations for the maximum output power of PTO system, and the global optimal solution is obtained. Compared with the traversal algorithm, the algorithm involved in this paper is efficient and the optimal output power obtained can provide a scientific basis for the structural optimization design and material selection of the wave energy device. [ABSTRACT FROM AUTHOR]

The modelling and analysis of high‐frequency bearing voltage are of great significance to the assessment and mitigation of the electrical erosion risk in wind power systems. However, the dual‐winding permanent magnet synchronous generator (DW‐PMSG), as one of the mainstream models in wind power industry, has not been specifically analysed for its bearing voltage modelling method in the existing research. The high frequency common mode equivalent circuit model of DW‐PMSG is established, and the effect of parasitic parameters between two sets of winding on bearing voltage is analysed. A model parameters extraction method based on differential evolution algorithm is proposed, and the range of parameters is estimated by finite element simulation and test results, which improves the search efficiency and solution accuracy. The accuracy of the proposed model is verified by the comparison of simulation and experimental results. On this basis, it is possible to conduct more in‐depth research on the bearing voltage and bearing currents of DW‐PMSG, and provide theoretical basis and simulation means for the design of suppression schemes. [ABSTRACT FROM AUTHOR]

Regional Integrated Energy Systems (RIESs) and Shared Energy Storage Systems (SESSs) have significant advantages in improving energy utilization efficiency. However, establishing a coordinated optimization strategy between RIESs and SESSs is an urgent problem to be solved. This paper constructs an operational framework for RIESs considering the participation of SESSs. It analyzes the game relationships between various entities based on the dual role of energy storage stations as both energy consumers and suppliers, and it establishes optimization models for each stakeholder. Finally, the improved Differential Evolution Algorithm (JADE) combined with the Gurobi solver is employed on the MATLAB 2021a platform to solve the cases, verifying that the proposed strategy can enhance the investment willingness of energy storage developers, balance the interests among the Integrated Energy Operator (IEO), Energy Storage Operator (ESO) and the user, and improve the overall economic efficiency of RIESs. [ABSTRACT FROM AUTHOR]

In the present work, India's primary energy use is analysed in terms of four socio-economic variables, including Gross Domestic Product, population, and the amounts of exports and imports. Historical data were obtained from the World Bank database for 44 years as annual values (1971–2014). Energy use is analysed as an optimisation problem, where a unique ensemble of two metaheuristic algorithms, Grammatical Evolution (GE), and Differential Evolution (DE), is applied. The energy optimisation problem has been investigated in two ways: estimation and a year-ahead prediction. Models are compared using RMSE (objective function) and further ranked using the Global Performance Index (GPI). For the estimation problem, RMSE values are found to be as low as 0.0078 and 0.0103 on training and test datasets, respectively. The average estimated energy use is found in good agreement with the data (RMSE = 6.3749 kgoe/capita), and the best model (E10) has an RMSE of 5.8183 kgoe/capita, with a GPI of 1.7249. For the prediction problem, RMSE is found to be 0.0096 and 0.0122 on training and test datasets, respectively. The average predicted energy use has RMSE of 7.8857 (kgoe/capita), while Model P20 has the best value of RMSE (7.9201 kgoe/capita) and a GPI of 1.8836. [ABSTRACT FROM AUTHOR]

The complex well function formulations developed for unconfined aquifer systems make the determination of aquifer parameters difficult and inefficient using classical methods. In addition, the dimensional dependency of aquifer parameters, as well as the non-linear and non-convex nature of inverse groundwater problems, can make the stand-alone use of the metaheuristic algorithms inefficient in terms of computation time and effort, producing non-unique solutions. Therefore, a novel optimisation framework was established to interpret pumping test data collected from an unconfined aquifer. The proposed approach works with four inputs that are based on the hybrid use of two non-dimensional physical and newly introduced two non-physical parameters. The method has the benefit of the simplicity of traditional methods and the accuracy of the differential evolution algorithm (DEA). The capability of the proposed scheme was broadly examined using several pumping test scenarios, including hypothetical and real field test datasets. Sensitivity analysis was also performed to understand the uncertainty associated with the estimated flow parameters. The results show that the proposed scheme, powered by the DEA, is able to achieve outstanding estimation performance compared with conventional methods and other nature-inspired algorithms. [ABSTRACT FROM AUTHOR]

Recent research has revealed that subtle imperceptible perturbations can deceive well-trained neural network models, leading to inaccurate outcomes. These instances, known as adversarial examples, pose significant threats to the secure application of machine learning techniques in safety-critical systems. In this paper, we delve into the study of one-pixel attacks in deep neural networks, recently reported as a kind of adversarial examples. To identify such one-pixel attacks, most existing methodologies rely on the differential evolution method, which utilizes random selection from the current population to escape local optima. However, the differential evolution technique might waste search time and overlook good solutions if the number of iterations is insufficient. Hence, in this paper, we propose a gradient ascent with momentum approach to efficiently discover good solutions for the one-pixel attack problem. As our method takes a more direct route to the goal compared to existing methods relying on blind random walks, it can effectively identify one-pixel attacks. Our experiments conducted on popular CNNs demonstrate that, in comparison with existing methodologies, our technique can detect one-pixel attacks significantly faster. [ABSTRACT FROM AUTHOR]